翻訳と辞書
Words near each other
・ Fairchild BQ-3
・ Fairchild Brothers & Foster
・ Fairchild C-119 Flying Boxcar
・ Fairchild C-123 Provider
・ Fairchild C-26 Metroliner
・ Fairchild C-82 Packet
・ Fairchild Camera and Instrument
・ Fairchild Channel F
・ Fairchild Corporation
・ Fairchild Dornier 328JET
・ Fairchild Dornier 428JET
・ Fairchild Dornier 728 family
・ Fairchild F Videocarts
・ Fair-Haired Child
・ Fair-Rutherford and Rutherford Houses
Fair-share scheduling
・ Fairacres, New Mexico
・ Fairacres, Roehampton
・ Fairall
・ Fairazi movement
・ Fairbairn
・ Fairbairn (disambiguation)
・ Fairbairn Avenue
・ Fairbairn baronets
・ Fairbairn College
・ Fairbairn Dam
・ Fairbairn steam crane
・ Fairbairn, Canberra
・ Fairbairn–Sykes fighting knife
・ Fairbank


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Fair-share scheduling : ウィキペディア英語版
Fair-share scheduling

Fair-share scheduling is a scheduling algorithm for computer operating systems in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution among processes.
One common method of logically implementing the fair-share scheduling strategy is to recursively apply the round-robin scheduling strategy at each level of abstraction (processes, users, groups, etc.) The time quantum required by round-robin is arbitrary, as any equal division of time will produce the same results.
This was first developed by Judy Kay and Piers Lauder through their research at Sydney University in the 1980s.〔http://sydney.edu.au/engineering/it/~judy/Research_fair/index.html〕
==Example==
For example, if four users (A,B,C,D) are concurrently executing one process each, the scheduler will logically divide the available CPU cycles such that each user gets 25% of the whole (100% / 4 = 25%). If user B starts a second process, each user will still receive 25% of the total cycles, but each of user B's processes will now be attributed 12.5% of the total CPU cycles each, totalling user B's fair share of 25%. On the other hand, if a new user starts a process on the system, the scheduler will reapportion the available CPU cycles such that each user gets 20% of the whole (100% / 5 = 20%).
Another layer of abstraction allows us to partition users into groups, and apply the fair share algorithm to the groups as well. In this case, the available CPU cycles are divided first among the groups, then among the users within the groups, and then among the processes for that user. For example, if there are three groups (1,2,3) containing three, two, and four users respectively, the available CPU cycles will be distributed as follows:
* 100% / 3 groups = 33.3% per group
* Group 1: (33.3% / 3 users) = 11.1% per user
* Group 2: (33.3% / 2 users) = 16.7% per user
* Group 3: (33.3% / 4 users) = 8.3% per user

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Fair-share scheduling」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.